package LanQiao;

public class Demo1 {
    public static void main(String[] args) {
        int count = 0;
        for (int i = 2; i < 2024; i++) {
            if (isPrime(i) && 2024 % i == 0) {
                count++;
            }
        }
        System.out.println(count);
    }

    private static boolean isPrime(int num) {
        for (int i = 2; i < num; i++) {
            if (num % 2 == 0) {
                return false;
            }
        }
        return true;
    }
}
